An analytic ray-tracing algorithm for weak lensing
نویسندگان
چکیده
منابع مشابه
Ray Tracing Simulations of Weak Lensing by Large-Scale Structure
We investigate weak lensing by large-scale structure using ray tracing through N-body simulations. Photon trajectories are followed through high resolution simulations of structure formation to make simulated maps of shear and convergence on the sky. Tests with varying numerical parameters are used to calibrate the accuracy of computed lensing statistics on angular scales from ∼ 1 arcminute to ...
متن کاملTracing Matter with Weak Lensing Surveys
Gravitational weak lensing maps the location of (dark) matter at all scales. The lens-induced distortion field traces gravity fields and can be used to reconstruct the mass distribution in galaxies, groups, clusters of galaxies or large-scale structures. From these reconstructions, one can in principle recover where the matter is, what are its properties and how it is coupled with light and bar...
متن کاملAn Efficient and Stable Ray Tracing Algorithm for Parametric Surfaces
In this paper, we propose an efficient and stable algorithm for finding the ray-surface intersections. Newton’s method and Bézier clipping are adapted to form the core of our algorithm. Ray coherence is used to find starting points for Newton iteration. We introduce an obstruction detection technique to verify whether an intersection point found by using Newton’s method is the closest one. When...
متن کاملAn Implementation of Ray Tracing Algorithm for the Multiprocessor Machines
Ray Tracing is an algorithm for generating photo-realistic pictures of the 3D scenes, given scene description, lighting condition and viewing parameters as inputs. The algorithm is inherently convenient for parallelization and the simplest parallelization scheme is for the shared-memory parallel machines (multiprocessors). This paper presents two implementations of the algorithm developed by th...
متن کاملThe HERO Algorithm for Ray-Tracing Octrees
An algorithm is presented for rapid traversal of octree data structures, in order to enhance the speed of ray tracing for scenes of high complexity. At each level of the octree, the algorithm generates the addresses of child voxels in the order they are penetrated by the ray. This requires only a few arithmetic operations and simple logical operations. A depth-first search of the tree is used t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Monthly Notices of the Royal Astronomical Society
سال: 2011
ISSN: 0035-8711
DOI: 10.1111/j.1365-2966.2011.18754.x